Multi-player Go

نویسنده

  • Tristan Cazenave
چکیده

Multiplayer Go is Go played with more than two colors. Monte-Carlo tree search is an adequate algorithm to program the game of Go with two players. We address the application of Monte-Carlo tree search to multiplayer Go.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analysis of UCT in Multi-player Games

The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an analysis of the UCT algorithm in multi-player games, showing that UCT, when run in a multi-player game, is computing a mixed-strategy equilibrium, as opposed to max, which computes a pure-strategy equilibrium. We anal...

متن کامل

Player Modeling, Search Algorithms and Strategies in Multi-player Games

For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less, and although literature of game theory f...

متن کامل

Multi-agent Monte Carlo Go

In this paper we propose a Multi-Agent version of UCT Monte Carlo Go. We use the emergent behavior of a great number of simple agents to increase the quality of the Monte Carlo simulations, increasing the strength of the artificial player as a whole. Instead of one agent playing against itself, different agents play in the simulation phase of the algorithm, leading to a better exploration of th...

متن کامل

Monte-Carlo Tree Search in Settlers of Catan

Games are considered important benchmark opportunities for artificial intelligence research. Modern strategic board games can typically be played by three or more people, which makes them suitable test beds for investigating multi-player strategic decision making. Monte-Carlo Tree Search (MCTS) is a recently published family of algorithms that achieved successful results with classical, two-pla...

متن کامل

Exploring Interpersonal Touch-Based Interaction and Player Socialization in Prism Squad: GO!

The value of socializing in collocated multiplayer video games should not be underestimated. Inter-player interactions such as joking, bantering and strategizing all contribute towards creating rewarding and memorable gameplay experiences for the players involved. In this paper, we introduce Prism Squad: GO!, a cooperative, three-player video game which is designed to encourage and cultivate th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008